According to the codestyle in master, we avoid using Q* constainers and prefer STL ones. With std::set we have to use [count(obj) != 0] instead of contains(obj).

Thanks for the tip! That's much nicer than using std::find().

I changed this to use std::set instead of QSet. But I do not like the idea of counting the number of times an object appears in a set. The set either contains the object or it does not.

std::set is optimized in this place and never slower than find().

@mattmcclinch did you check whether your fix work with an embedded tuplets?

Manually merged to 2.3 as well. Thank you!